Abstract Complexity of Prolog Based on WAM
نویسنده
چکیده
Complexity of Prolog Based on WAM Alexander Ja. Dikovsky Russian Academy Inst. for Applied Mathematics, 4, Miusskaja sq., Moscow, Russia 125047 Email: [email protected] Fax: (7-095-)972-0737 Abstract. Simple definitions of time and space complexity measures of Prolog programs based on an abstraction of Warren Abstract Machine instructions set is suggested. Its effect is discussed on practical measuring time and space consumption, complexity classifications and optimization of programs. Simple definitions of time and space complexity measures of Prolog programs based on an abstraction of Warren Abstract Machine instructions set is suggested. Its effect is discussed on practical measuring time and space consumption, complexity classifications and optimization of programs.
منابع مشابه
Interprocedural Register Allocation for the WAM based on Source to Source Transformations
An approach for interprocedural register allocation for the WAM is presented which is based on source-to-source transformations of an intermediary language called Continuation Prolog. Continuation Prolog fills the conceptual gap between Prolog source code and the underlying abstract machine. Our approach does not require an analysis of the whole program. Only the definition of a predicate must ...
متن کاملNative Code Compilation in SICStus Prolog
SICStus Prolog is a sequential Prolog implementation built around a version of the Warren Abstract Machine (WAM). For several years, SICStus has supported WAM-to-native code compilation for Sun workstations. This old scheme is neither as portable nor as open to experiments as would be desirable. With the support of my colleagues in the SICStus group, I have developed a new scheme that is more o...
متن کاملVerification of Compiler Correctness for the WAM
Relying on a derivation of the Warren Abstract Machine (WAM) by stepwise reenement of Prolog models by BB orger and Rosen-zweig we present a formalization of an operational semantics for Prolog. Then we develop four reenement steps towards the Warren Abstract Machine (WAM). The correctness and completeness proofs for each step have been elaborated with the theorem prover Isabelle using the logi...
متن کاملVeri cation of Compiler Correctness for the WAM
Relying on a derivation of the Warren Abstract Machine WAM by stepwise re nement of Prolog models by B orger and Rosen zweig we present a formalization of an operational semantics for Prolog Then we develop four re nement steps towards the Warren Abstract Machine WAM The correctness and completeness proofs for each step have been elaborated with the theorem prover Isabelle using the logic HOL
متن کاملInput Sharing for findall/3
A simple addition to findall/3 achieves sharing between answers in the solution list and the input to findall/3. This reduces the time and space complexity of some queries. Its overhead is extremely small. It can be integrated in any WAM-like Prolog implementation. Input Sharing for findall/3 Phuong-Lan Nguyen and Bart Demoen∗ @ Institut de Mathématiques Appliquées, UCO, Angers, France Departme...
متن کامل